Genericity and minimax optimization
نویسندگان
چکیده
منابع مشابه
Genericity and Porosity in Nonlinear Analysis and Optimization
We present several recent examples of the generic approach to nonlinear problems. In this approach, instead of considering, for instance, the convergence of an algorithm, one investigates an appropriate space of algorithms equipped with some natural complete metric and shows that convergence does indeed occur for most algorithms there. As we shall see, sometimes one can show that the complement...
متن کاملAlgorithms for minimax and expected value optimization
Many decision models can be formulated as continuous minimax problems. The minimax framework injects robustness into the model. It is a tool that one can use to perform worst–case analysis, and it can provide considerable insight into the decision process. It is frequently used alongside other methods such as expected value optimization in order to identify extreme scenarios and strategies that...
متن کاملRobustness in portfolio optimization based on minimax regret approach
Portfolio optimization is one of the most important issues for effective and economic investment. There is plenty of research in the literature addressing this issue. Most of these pieces of research attempt to make the Markowitz’s primary portfolio selection model more realistic or seek to solve the model for obtaining fairly optimum portfolios. An efficient frontier in the ...
متن کاملA Genetic Algorithm for Minimax Optimization Problems
Robust discrete optimization is a technique for structuring uncertainty in the decision-making process. The objective is to find a robust solution that has the best worst-case performance over a set of possible scenarios. However, this is a difficult optimization problem. This paper proposes a two-space genetic algorithm as a general technique to solve minimax optimization problems. This algori...
متن کاملParticle Swarm Optimization for Minimax Problems
This paper investigates the ability of the Particle Swarm Optimization (PSO) method to cope with minimax problems through experiments on well{known test functions. Experimental results indicate that PSO tackles minimax problems e ectively. Moreover, PSO alleviates di culties that might be encountered by gradient{based methods, due to the nature of the minimax objective function, and potentially...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Inequalities & Applications
سال: 2005
ISSN: 1331-4343
DOI: 10.7153/mia-08-66